The Curves Encoding
نویسندگان
چکیده
In this paper we present an image description model that uses picture description language, and Bezier interpolation. We study 3-type images (represented by closed curves that conserve the critical points), giving modelling techniques, and also the coresponding algorithm. Our goal is to obtain a minimal description Πl-word of the smooth curves that aproximate the initial given curves.
منابع مشابه
Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time
We provide new hash functions into (hyper)elliptic curves over finite fields. These functions aims at instantiating in a secure manner cryptographic protocols where we need to map strings into points on algebraic curves, typically user identities into public keys in pairingbased IBE schemes. Contrasting with recent Icart’s encoding, we start from “easy to solve by radicals” polynomials in order...
متن کاملEfficient Indifferentiable Hashing into Ordinary Elliptic Curves
We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart’s deterministic encoding from Crypto 2009. While almost as efficient as Icart’s encoding, this hash function can be plugged into any cryptosystem that requires hashing into elliptic curves, while not compromising proofs of security in the random oracle...
متن کاملHashing into Generalized Huff Curves
Huff curves are well known for efficient arithmetics to their group law. In this paper, we propose two deterministic encodings from Fq to generalized Huff curves. When q ≡ 3 (mod 4), the first deterministic encoding based on Skalpa’s equality saves three field squarings and five multiplications compared with birational equivalence composed with Ulas’ encoding. It costs three multiplications les...
متن کاملDeterministic Encoding and Hashing to Odd Hyperelliptic Curves
In this paper we propose a very simple and efficient encoding function from Fq to points of a hyperelliptic curve over Fq of the form H : y = f(x) where f is an odd polynomial. Hyperelliptic curves of this type have been frequently considered in the literature to obtain Jacobians of good order and pairing-friendly curves. Our new encoding is nearly a bijection to the set of Fq-rational points o...
متن کاملEfficient Decoding Methods in Goppa codes based on Klein Curves
The use of Algebraic curves in coding theory provides a great deal of flexibility. The rate of encoding and decoding of codes depends greatly on its construction. In this research report we will establish the mathematical basis for coding theory, algebraic curves and encoding and decoding techniques which improve the performance of coding systems. We will also investigation two different Klein ...
متن کاملIndifferentiable deterministic hashing to elliptic and hyperelliptic curves
At Crypto 2010, Brier et al. proposed the first construction of a hash function into ordinary elliptic curves that was indifferentiable from a random oracle, based on Icart’s deterministic encoding from Crypto 2009. Such a hash function can be plugged into any cryptosystem that requires hashing into elliptic curves, while not compromising proofs of security in the random oracle model. However, ...
متن کامل